Tiling a Square with Eight Congruent Polyominoes
نویسنده
چکیده
The problem of finding polyominoes that tile rectangles has attracted a lot of attention; see [1] for an overview, and [2, 3] for more recent results. Several general families of such polyominoes are known, but sporadic examples seem to be scarce. Marshall [2, Fig. 9] gives a polyomino of rectangular order 8, and asks if it can be generalized to a family of rectifiable polyominoes. Here we show one way to generalize Marshall’s construction, which yields an infinite family of polyominoes of rectangular order 8. Marshall’s construction is the first square in Figure 1.
منابع مشابه
On Tilings of Quadrants and Rectangles and Rectangular Pattern
The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by polyominoes. Indeed, if all tilings of a (skewed) quadrant by a tile set can be reduced to a tiling by congruent rectangles (parallelograms), this provides information about tilings...
متن کاملEnumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry
We describe computer algorithms that can enumerate and display, for a given n > 0 (in theory, of any size), all n-ominoes, niamonds, and n-hexes that can tile the plane using only rotations; these sets necessarily contain all such tiles that are fundamental domains for p4, p3, and p6 isohedral tilings. We display the outputs for small values of n. This expands on earlier work [3]. 1 Polyominoes...
متن کاملOn the tiling by translation problem
On square or hexagonal lattices tiles or polyominoes are coded by words. The polyominoes that tile the plane by translation are characterized by the Beauquier-Nivat condition. By using the constant time algorithms for computing the longest common extensions in two words, we provide a linear time algorithm in the case of pseudo-square polyominoes, improving the previous quadratic algorithm of Ga...
متن کاملTiling Rectangles and Half Strips with Congruent Polyominoes
Michael Reid Brown University February 23, 1996
متن کاملCombinatorial properties of double square tiles
We study the combinatorial properties and the problem of generating exhaustively double square tiles, i.e. polyominoes yielding two distinct periodic tilings by translated copies such that every polyomino in the tiling is surrounded by exactly four copies. We show in particular that every prime double square tile may be obtained from the unit square by applying successively some invertible oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 83 شماره
صفحات -
تاریخ انتشار 1998